Some Theorems about N-Vertex Connected Graphs
نویسندگان
چکیده
منابع مشابه
Vertex Covers and Connected Vertex Covers in 3-connected Graphs
A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively. A connected vertex cover of a graph G is a vertex cover of G such that the subgraph G[N] induced by N of G is connected. The minimum vertex cover problem (VCP) is the problem of finding a vertex cover of mini...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملConnected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in dense graphs, in which either the minimum or the average degree is linear. In particular, we prove tight parameterized upper bounds on the approximation returned by Savage’s algorithm, and extend a vertex cover algorit...
متن کاملSelf Vertex Switching of Connected Bicyclic Graphs
-A vertex v V(G) is said to be a self vertex switching of G if G is isomorphic to G v , where G v is the graph obtained from G by deleting all edges of G incident to v and adding all edges incident to v which are not in G. In [5], trees and forests are characterized, each with a self vertex switching. In [6], connected unicyclic graphs, each with a self vertex switching are characterized. In th...
متن کاملConnected Tropical Subgraphs in Vertex-Colored Graphs
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the graph. In this work we study the problem of finding a minimal connected tropical subgraph. We first show that this problem is NP-Hard for trees, interval graphs and split graphs, but polynomial when the number of colors is logarithmic in terms of the order of the graph (i.e. FPT). We then provide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1966
ISSN: 0022-2518
DOI: 10.1512/iumj.1967.16.16022